Analyzing completeness of axiomatic functional systems for temporal × modal logics
نویسندگان
چکیده
In previous works, we presented a modification of the usual possible world semantics by introducing an independent temporal structure in each world and using accessibility functions to represent the relation among them. Different properties of the accessibility functions (being injective, surjective, increasing, etc.) have been considered and axiomatic systems (called functional) which define these properties have been given. Only a few of these systems have been proved to be complete. The aim of this paper is to make a progress in the study of completeness for functional systems. For this end, we use indexes as names for temporal flows and give new proofs of completeness. Specifically, we focus our attention on the system which defines injectivity, because the system which defines this property without using indexes was proved to be incomplete in previous works. The only system considered which remains incomplete is the one which defines surjectivity, even if we consider a sequence of natural extensions of the previous one.
منابع مشابه
Functional systems in the context of temporal×modal logics with indexed flows
We consider logics which define different properties of functions –such as injectivity, surjectivity, monotonicity, etc.– in the context of temporal×modal logic. In this type of logics, the possible worlds semantics is modified by considering each world as a temporal flow and using accessibility functions to represent the connection among them. This approach is adequate to model interactions be...
متن کاملModal Logic over Higher Dimensional Automata
Higher dimensional automata (HDA) are a model of concurrency [5, 8] that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or Petri nets. Modal logics, interpreted over Kripke structures, are the logics for reasoning about sequential behavior and interleaved concurrency. Modal logic is a well behaved subset of first-order logic; many v...
متن کاملModular construction of complete coalgebraic logics
We present a modular approach to defining logics for a wide variety of state-based systems. The systems are modelled as coalgebras, and we use modal logics to specify their observable properties. We show that the syntax, semantics and proof systems associated to such logics can all be derived in a modular fashion. Moreover, we show that the logics thus obtained inherit soundness, completeness a...
متن کاملCompleteness and Soundness of Axiomatizations for Temporal Logics. Without Next
We present axiomatizations for Until Temporal Logic (UTL) and for Since/Until Temporal Logic (SUTL). These logics are intended for use in specifying and reasoning about concurrent systems. They employ neither a next nor a previous operator, which obstruct the use of hierarchical abstraction and reenement, and make reasoning about concurrency diicult. We also provide a procedure for translating ...
متن کاملTwo-sorted Metric Temporal Logics
Temporal logic has been successfully used for modeling and analyzing the behavior of reactive and concurrent systems. Standard temporal logic is inadequate for real-time applications because it only deals with qualitative timing properties. This is overcome by metric temporal logics which offer a uniform logical framework in which both qualitative and quantitative timing properties can be expre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 56 شماره
صفحات -
تاریخ انتشار 2010